Erasure decoding of five times extended Reed-Solomon codes
نویسندگان
چکیده
منابع مشابه
Efficient erasure decoding of Reed-Solomon codes
We present a practical algorithm to decode erasures of Reed-Solomon codes over the q elements binary field in O(q log 2 q) time where the constant implied by the O-notation is very small. Asymptotically fast algorithms based on fast polynomial arithmetic were already known, but even if their complexity is similar, they are mostly impractical. By comparison our algorithm uses only a few Walsh tr...
متن کاملEfficient Erasure Decoding for Generalized Reed Solomon Codes
We present an efficient erasure decoding algorithm for generalized Reed Solomon codes constructed by utilizing the structure of the inverse of the VanderMonde matrices. Given an [n, k] generalized Reed Solomon code, decoding for r erasures, where r = n − k, requires rk + n Galois field multiplications and r(k − 1) Galois field additions after setting up the decoding structures for an erasure pa...
متن کاملPartial Reed Solomon Codes for Erasure Channels
In this paper, we introduce a new family of linear block codes, which we refer to as Partial Reed Solomon (PRS) Codes. These codes are specifically designed and optimized for real-time multimedia communication over packet-based erasure channels. Based on the constraints and flexibilities of real time applications, we define a performance measure, message throughput ( m τ ), which is suitable fo...
متن کاملList Decoding of Reed-Solomon Codes
This master thesis has been written for the completion of the author’s study of mathematics and deals with recent developments in coding theory. In particular, descriptions are given of recent algorithms for generating a list of all words form a Reed–Solomon code that are close to a received word. These algorithms may be adapted so that they can take into account the reliability information of ...
متن کاملMaximum Likelihood Decoding of Reed Solomon Codes
We present a randomized algorithm which takes as input n distinct points {(xi, yi)}i=1 from F ×F (where F is a field) and integer parameters t and d and returns a list of all univariate polynomials f over F in the variable x of degree at most d which agree with the given set of points in at least t places (i.e., yi = f(xi) for at least t values of i), provided t = Ω( √ nd). The running time is ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Electrical Engineering
سال: 2019
ISSN: 1339-309X
DOI: 10.2478/jee-2019-0035